• Educating the energy informatics specialist: opportunities and challenges in light of research and industrial trends 

      Bordin, Chiara; Mishra, Sambeet; Safari, Amir; Eliassen, Frank (Journal article; Tidsskriftartikkel; Peer reviewed, 2021-05-30)
      Contemporary energy research is becoming more interdisciplinary through the involvement of technical, economic, and social aspects that must be addressed simultaneously. Within such interdisciplinary energy research, the novel domain of energy informatics plays an important role, as it involves different disciplines addressing the socio-techno-economic challenges of sustainable energy and power ...
    • An efficient bill-of-materials algorithm 

      Khalaila, Ahmad; Eliassen, Frank (Research report; Forskningsrapport, 1997-04)
      A large class of linear recursive queries compute the bill-of-materials of database relations.This paper presents a novel algorithm that computes the bill-of-materials of its argument's (database) relation. The algorithm uses a special join operation that accumulates the cost of composite parts, without constructing the transitive closure of the argument relation, thus saving time and space. We ...
    • Efficient bill-of-materials algorithms 

      Beeri, Catriel; Khalaila, Ahmad; Eliassen, Frank (Research report; Forskningsrapport, 1996-09-01)
      It has been shown that every linearly recursive database query can be expressed as a transitive closure possibly preceded and followed by relational algebraic operations. A large class of such queries computes the bill-of-materials of database relations. This paper presents efficient sequential and distributed algorithms that compute the bill-of-materials of a database relation. These algorithms ...
    • On the design of a generic object adaptor 

      Eliassen, Frank; Hanssen, Øyvind (Conference object; Konferansebidrag, 1995-08)
    • Quick- instead of Merge-sort for pipelines systems 

      Khalaila, Ahmad H.; Eliassen, Frank (Research report; Forskningsrapport, 1997-05)
      This paper proposes an external sorting algorithm for large data as an alternative to the widely used merge-sort algorithm. The algorithm we present is an application of the widely known quick-sort algorithm to large sequences of data stored externally on a disk device. The problem with the merge-sort algorithm is not its time complexity but the large amount of time it requires to output its first ...